Optimization of Truck-Drone Parcel Delivery Using Metaheuristics

This research addresses a variant of the traveling salesman problem in drone-based delivery systems known as TSP-D. The TSP-D is combinatorial optimization which truck and drone collaborate to deliver parcels customers, with objective minimizing total time. Determining optimal solution NP-hard; thus, size problems that can be solved optimally limited. Therefore, metaheuristics are used solve problem. Metaheuristics adaptive intelligent algorithms have proved their success many similar problems. In this study, using greedy, randomized search procedure two local alternatives self-adaptive neighborhood selection scheme presented. proposed approach was tested on 200 instances different properties from publicly available “Instances TSP Drone” benchmark. Results were evaluated against state-of-the-art algorithms. Non-parametric statistical tests concluded has comparable performance rival (p=0.074) terms tour duration. better or where same speed (α=1).